A formal system for specification analysis of concurrent programs

Formal Specification and Verification of Concurrent Programs Curriculum Module SEI-CM-27-1.0 Formal Specification and Verification of Concurrent Programs

Automatic programming consists not(From Preface) The AFFIRM Annotated Transcriptsonly of an automatic compiler, but also some meansvolume illustrates a number of features of AFFIRM.of acquiring the high-level specification to be com-Each transcript is prefaced with a short descriptionpiled, some means of determining that it is the in-of what the transcript deals with...

Formal reasoning about concurrent programs using a lazy- STM system

Transactional memory (TM) is an easy-using parallel programming model that avoids common problems associated with conventional locking techniques. Several researchers have proposed alternative hardware and software TM implementations. However, few ones focus on formal reasoning about programs using TM system. In this paper, we propose a framework at assembly level for reasoning about concurrent...

A Formal Basis for the Specification of Concurrent Systems

Testing of Concurrent Programs After Specification Changes

This paper describes a specification-based regression testing technique that can be applied for revalidating concurrent programs after specification changes. This kind of regression testing technique requires sequencing constraints which specify the precedence relations among synchronization events. In our method, the sequencing constraints are extracted automatically from Message Sequence Char...

Verification and Specification of Concurrent Programs

I explore the history of, and lessons learned from, eighteen years of assertional methods for specifying and verifying concurrent programs. I then propose a Utopian future in which mathematics prevails.